Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies
نویسنده
چکیده
In 1969, V. Strassen improves the classical~2x2 matrix multiplication algorithm. The current upper bound for 3x3 matrix multiplication was reached by J.B. Laderman in 1976. This note presents a geometric relationship between Strassen and Laderman algorithms. By doing so, we retrieve a geometric formulation of results very similar to those presented by O. Sykora in 1977.
منابع مشابه
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
The main purpose of this paper is to present a fast matrix multiplication algorithm taken from the paper of Laderman et al. (Linear Algebra Appl. 162–164 (1992) 557) in a re-ned compact “analytical” form and to demonstrate that it can be implemented as quite e1cient computer code. Our improved presentation enables us to simplify substantially the analysis of the computational complexity and num...
متن کاملNew Practical Strassen-like Approximate Matrix-multiplication Algorithms Found via Solving a System of Cubic Equations
We have encapsulated the concept of matrix multiplication into a system of cubic equations. We discuss the properties of this system and the symmetry group of the set of solutions. Using solutions of these equations, we propose new algorithms for matrix multiplication, with explicit inequalities that bound the error. Also we calculate exactly the “hidden coefficient” in the Big-Oh notation for ...
متن کاملA Strassen-like Matrix Multiplication Suited for Squaring and Highest Power Computation
Strassen method is not the asymptotically fastest known matrix multiplication algorithm, but it is the most widely used for large matrices on finite fields. Since his manuscript was published, a number of variants have been proposed with various addition complexities. Here we describe a new one. The new variant is as good as those already known for a simple matrix multiplication, but can save o...
متن کاملStrassen's Matrix Multiplication Algorithm for Matrices of Arbitrary Order
The well known algorithm of Volker Strassen for matrix multiplication can only be used for (m2 ×m2) matrices. For arbitrary (n× n) matrices one has to add zero rows and columns to the given matrices to use Strassen’s algorithm. Strassen gave a strategy of how to set m and k for arbitrary n to ensure n ≤ m2 . In this paper we study the number d of additional zero rows and columns and the influen...
متن کاملSymmetries of matrix multiplication algorithms. I
In this work the algorithms of fast multiplication of matrices are considered. To any algorithm there associated a certain group of automorphisms. These automorphism groups are found for some well-known algorithms, including algorithms of Hopcroft, Laderman, and Pan. The automorphism group is isomorphic to S3 × Z2 and S4 for Hopcroft anf Laderman algorithms, respectively. The studying of symmet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1703.08298 شماره
صفحات -
تاریخ انتشار 2017